rTableICC: An R Package for Random Generation of 2×2×K and R×C Contingency Tables
نویسنده
چکیده
In this paper, we describe the R package rTableICC that provides an interface for random generation of 2×2×K and R×C contingency tables constructed over either intraclass-correlated or uncorrelated individuals. Intraclass correlations arise in studies where sampling units include more than one individual and these individuals are correlated. The package implements random generation of contingency tables over individuals with or without intraclass correlations under various sampling plans. The package include two functions for the generation of K 2×2 tables over product-multinomial sampling schemes and that of 2×2×K tables under Poisson or multinomial sampling plans. It also contains two functions that generate R×C tables under product-multinomial, multinomial or Poisson sampling plans with or without intraclass correlations. The package also includes a function for random number generation from a given probability distribution. In addition to the contingency table format, the package also provides raw data required for further estimation purposes.
منابع مشابه
Plain Answers to Several Questions about Association/Independence Structure in Complete/Incomplete Contingency Tables
In this paper, we develop some results based on Relational model (Klimova, et al. 2012) which permits a decomposition of logarithm of expected cell frequencies under a log-linear type model. These results imply plain answers to several questions in the context of analyzing of contingency tables. Moreover, determination of design matrix and hypothesis-induced matrix of the model will be discusse...
متن کاملSampling contingency tables
Given positive integers r1; r2; : : : rm and c1; c2; : : : cn, let I(r; c) be the set ofm n arrays with nonnegative integer entries and row sums r1; r2; : : : rm respectively and column sums c1; c2; : : : cn respectively. Elements of I(r; c) are called contingency tables with these row and column sums. We consider two related problems on contingency tables. Given r1; r2; : : : rm and c1; c2; : ...
متن کاملCharacterizing Optimal Sampling of Binary Contingency Tables via the Configuration Model
A binary contingency table is an m×n array of binary entries with row sums r = (r1, . . . , rm) and column sums c = (c1, . . . , cn). The configuration model generates a contingency table by considering ri tokens of type 1 for each row i and cj tokens of type 2 for each column j, and then taking a uniformly random pairing between type-1 and type-2 tokens. We give a necessary and sufficient cond...
متن کاملPartial Association Components in Multi-way Contingency Tables and Their Statistiical Analysis
In analyses of contingency tables made up of categorical variables, the study of relationship between the variables is usually the major objective. So far, many association measures and association models have been used to measure the association structure present in the table. Although the association measures merely determine the degree of strength of association between the study varia...
متن کاملAn approximation algorithm for counting contingency tables
We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column sums C = (c1, . . . , cn). We define smooth margins (R,C) in terms of the typical table and prove that for such margins the algorithm has quasi-polynomial NO(lnN) complexity, where N = r1 + · · · + rm = c1 + · · · + cn. Various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016